#-*- coding utf-8 -*-
'''
autor: Pedro Moreira
'''
import time

def fibonacci_recursivo(n):
	if n==0:
		return 0
	elif n==1:
		return 1
	else:
		return fibonacci_recursivo(n-2) + fibonacci_recursivo(n-1)

def fibonacci_iterativo(n):
	i = 1
	j = 0
	for k in range(n):
		t = i+j
		i, j = j, t
	return j

N = 1000


for n in range(150000, 250000, 5000):
	t1  = time.clock()
	fibonacci_iterativo(n)
	t2 = time.clock()
	print n, t2-t1
	
	
	pass 
